N ov 2 00 2 ENTROPY GEOMETRY AND DISJOINTNESS FOR ZERO - DIMENSIONAL ALGEBRAIC ACTIONS
نویسنده
چکیده
We show that many algebraic actions of higher-rank abelian groups on zero-dimensional groups are mutually disjoint. The proofs exploit differences in the entropy geometry arising from subdynamics and a form of Abramov–Rokhlin formula for half-space entropies. We discuss some mutual disjointness properties of algebraic actions of higher-rank abelian groups on zero-dimensional groups. The tools used are a version of the half-space entropies introduced by Kitchens and Schmidt [14] and adapted by Einsiedler [7], a basic geometric en-tropy formula from [7], and the structure of expansive subdynamics for algebraic Z d-actions due to Einsiedler, Lind, Miles and Ward [9]. We show that any collection of algebraic Z d-actions on zero-dimensional groups with entropy rank or co-rank one that look sufficiently different are mutually disjoint. The main results are the following (here N(·) denotes the set of non-expansive directions defined in Section 1). then the systems are mutually disjoint. The simplest illustration of Theorem 5.1 is the fact that Ledrappier's Example 2.3 and its mirror image are disjoint. This is shown directly in Section 3 to illustrate how the Abramov–Rokhlin formula for half-space entropies may be used. Theorem 6.2. Let Y and Z be prime Z d-actions with entropy co-rank one. If N(α Y) = N(α Z), then Y and Z are disjoint. Once again the simplest illustration of the meaning of this result comes from an example of Ledrappier type: Example 6.3 is a three-dimensional analogue of Ledrappier's example. This is a Z 3-action defined by a 'four-dot' condition which has positive entropy Z 2-subactions; it and its mirror image are disjoint. Surprisingly, it is not the familiar presence of different non-mixing sets but the entropy and subdynamical geometry of the systems that forces this high level of measurable difference of structure. The methods should extend to entropy rank or co-rank greater than one, but the notational and technical difficulties become more substantial. Related work for Z d-actions by toral automorphisms has been done by Kalinin and Katok [11], where more refined information is found about joinings and the consequences of the presence of non-trivial joinings. Actions by toral automorphisms automatically have entropy rank not exceeding one. Our purpose here is to begin to address some of the problems inherent in understanding the joinings between algebraic Z d-actions. The ultimate goal is to extend results like those of [11] to general algebraic actions, just as the rigidity results have been extended …
منابع مشابه
On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product
In this paper we study the (Bichromatic) Maximum Inner Product Problem (Max-IP), in which we are given sets A and B of vectors, and the goal is to find a ∈ A and b ∈ B maximizing inner product a · b. Max-IP is very basic and serves as the base problem in the recent breakthrough of [Abboud et al., FOCS 2017] on hardness of approximation for polynomial-time problems. It is also used (implicitly) ...
متن کاملTesting Geometric Properties ∗ †
In this paper we study property testing for basic geometric properties. We aim at developing efficient algorithms which determine whether a given (geometrical) object has a predetermined property Q or is “far” from any object having the property. We show that many basic geometric properties have very efficient testing algorithms, whose running time is significantly smaller than the object descr...
متن کاملDisjointness Graphs of Segments
The disjointness graph G = G(S) of a set of segments S in R, d ≥ 2, is a graph whose vertex set is S and two vertices are connected by an edge if and only if the corresponding segments are disjoint. We prove that the chromatic number of G satisfies χ(G) ≤ (ω(G))4 + (ω(G))3, where ω(G) denotes the clique number of G. It follows, that S has Ω(n1/5) pairwise intersecting or pairwise disjoint eleme...
متن کاملA Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially
We establish that the extension complexity of the n × n correlation polytope is at least 1.5 n by a short proof that is self-contained except for using the fact that every face of a polyhedron is the intersection of all facets it is contained in. The main innovative aspect of the proof is a simple combinatorial argument showing that the rectangle covering number of the unique-disjointness matri...
متن کاملCS 663 : Computational Geometry
We will describe an O(n) time reduction from the set-disjointness problem to the farthest pairs problem. This will imply the Ω(n log n) lower bound. Consider an instance of the set-disjointness problem A = {a1, a2, . . . , an} and B = {b1, b2, . . . , bn}. We need to find out whether there exist i and j such that ai = bj. We map the sets A and B to the first and third quadrant of the unit circl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005